Three-Axes Rotation Algorithm for the Relaxed 3L-CVRP

The purpose of this work is to present a developed three-axes rotation algorithm improve the solving methodology for relaxed 3L-CVRP (Three-Dimensional Capacitated Vehicle Routing Problem). Although there are reported works on approaches that consider product optimize load capacity, three axes has not been thoroughly studied. In aspect, explicitly explores and its impact capacity optimization. order problem, two-phase solution was developed. first phase consists finding CVRP using demand previously obtained with heuristic convert into demand. second obtain loading vehicle items rules items. proposed approach able assignment in 48.1% well-known instances when compared similar 3L-CVRP. outcomes research can be applied transportation problems where package z-axis an option, fragile vehicles.